Morphology (single input)¶
Uses morphology based algorithms with a built-in structuring element
Documentation
Uses morphology based algorithms with a built-in structuring element
Algorithms:
Computes the convex hull of a binary image.
The convex hull is the set of pixels included in the smallest convexpolygon that surround all white pixels in the input image.
Computes the convex hull of each object in a binary image.
The convex hull is the set of pixels included in the smallest convexpolygon that surround all white pixels in the input image.
This function uses labeling to define unique objects, findsthe convex hull of each using convex_hull_image,
and combines these regions with logical OR. Be aware the convexhulls of unconnected objects may overlap in the result
Creates a unique integer label for each connected component in an integer valued or binary image.
- diagonal neighborhood:
If true then also consider diagonals for connectivity
Removes small holes from an integer or boolean image.
- diagonal neighborhood:
If true then also consider diagonals for connectivity
- n:
Maximum size in pixels of areas to remove (default 64)
Removes connected components smaller than the given size.
- diagonal neighborhood:
If true then also consider diagonals for connectivity
- n:
Maximum size in pixels of areas to remove (default 64)
Returns the skeleton of a binary image. Thinning is used to reduce each connected component in a binary image to a single-pixel wide skeleton.
- Input ports:
source : image
source image to filter
- Output ports:
result : image
result after filtering
Definition
Input ports
- source
image
source image to filter
Output ports
- result
image
result after filtering
- Configuration:
- Algorithm (algorithm)
(no description)
- n (n)
(no description)
- diagonal neighborhood (diagonal neighborhood)
(no description)